//
// Source code recreated from a .class file by IntelliJ IDEA
// (powered by FernFlower decompiler)
//

package 力扣.题库.未分类;

public class demo_1512 {
    public demo_1512() {
    }

    public int numIdenticalPairs(int[] nums) {
        int sum = 0;

        for(int i = 0; i < nums.length; ++i) {
            for(int j = i + 1; j < nums.length; ++j) {
                if (nums[i] == nums[j]) {
                    ++sum;
                }
            }
        }

        return sum;
    }
}
